منابع مشابه
06 Drawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for some positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point...
متن کاملDrawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for a positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point of...
متن کاملOn Partitioning Colored Points
Let us imagine that red candles and blue candles are placed on the top of a cake. We want to cut it with a knife into two pieces in such a way that all the red candles are on one of the two pieces and all the blue candles are on the other piece. A question is when we can cut it successfully. The following Kirchberger’s theorem [5] answers this question in a general setting. Let X be a finite su...
متن کاملColored Trees in Edge-Colored Graphs
The study of problems modeled by edge-colored graphs has given rise to important developments during the last few decades. For instance, the investigation of spanning trees for graphs provide important and interesting results both from a mathematical and an algorithmic point of view (see for instance [1]). From the point of view of applicability, problems arising in molecular biology are often ...
متن کاملMaximum colored trees in edge-colored graphs
Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.08.004